SPITFIRE: scalable parallel algorithms for test set partitioned fault simulation

نویسندگان

  • Dilip Krishnaswamy
  • Elizabeth M. Rudnick
  • Janak H. Patel
  • Prithviraj Banerjee
چکیده

We propose three synchronous parallel algorithms for scalable parallel test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors. The test set partitioning inherent in the algorithms overcomes the good circuit logic simulation bottleneck that exists in traditional fault partitioned approaches to parallel fault simulation. The implementations were done on a shared memory multiprocessor and on a network of workstations. Two of the algorithms show a small degree of pessimism in a few cases, with respect to the fault coverage as compared with a uniprocessor run, while the third algorithm provides the same results as in a uniprocessor run. All algorithms provide excellent speedups and perform much better than a traditional fault partitioned approach, on both shared and distributed memory parallel platforms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

International Conference on VLSI Design , January 1997 Overcoming the Serial Logic Simulation

We propose a new approach to parallelizing fault simulation in which the test set is partitioned among the available processors. The approach can be used for any of the sequential circuit fault simulation algorithms commonly used, and it can be implemented on various diierent parallel architectures. This approach for the rst time overcomes the limitations of serial logic simulation. In addition...

متن کامل

Improving the palbimm scheduling algorithm for fault tolerance in cloud computing

Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...

متن کامل

Algorithm-based Fault Tolerance for Floating-point Operations in Massively Parallel Systems

This paper considers the applicability of algorithm-based fault tolerance (ABFT) to massively parallel scientiic computation. Existing ABFT schemes can provide eeective fault tolerance at a low cost for computation on matrices of moderate size; however, the methods do not scale well to oating-point operations on large systems. This paper proposes the use of a partitioned linear encoding scheme ...

متن کامل

Faster Fault Simulation Through Distributed Computing

In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors test set partition and fault set partition. The sequential algorithm for fault si...

متن کامل

Dynamically Partitioned Test Scheduling for SoCs Under Power Constraints

Test scheduling increases parallelism of test application and reduces the test cost. In this paper, we present a novel scheduling algorithm for testing embedded core-based System-on-Chips. Given a system integrated with a set of cores and a set of test resources, we construct a set of power constrained concurrent test sets from a power-constrained test compatibility graph (P-TCG). Furthermore, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997